Hereditary properties of hypergraphs
نویسندگان
چکیده
A hereditary property P is a class of k-graphs closed under isomorphism and taking induced sub-hypergraphs. Let P (k) n denote those k-graphs of P (k) on vertex set {1, . . . , n}. We prove an asymptotic formula for log2 |P (k) n | in terms of a Turán-type function concerning forbidden induced sub-hypergraphs. This result complements several existing theorems for hereditary and monotone graph and hypergraph properties.
منابع مشابه
On the testability and repair of hereditary hypergraph properties
Recent works of Alon-Shapira [6] and Rödl-Schacht [30] have demonstrated that every hereditary property of undirected graphs or hypergraphs is testable with one-sided error; informally, this means that if a graph or hypergraph satisfies that property “locally” with sufficiently high probability, then it can be perturbed (or “repaired”) into a graph or hypergraph which satisfies that property “g...
متن کاملStructure and Enumeration Theorems for Hereditary Properties in Finite Relational Languages
Given a finite relational language L, a hereditary L-property is a class of finite Lstructures which is closed under isomorphism and model theoretic substructure. This notion encompasses many objects of study in extremal combinatorics, including (but not limited to) hereditary properties of graphs, hypergraphs, and oriented graphs. In this paper, we generalize certain definitions, tools, and re...
متن کاملHereditary properties of partitions, ordered graphs and ordered hypergraphs
In this paper we use the Klazar-Marcus-Tardosmethod (see [22]) to prove that if a hereditary property of partitions P has super-exponential speed, then for every k-permutation π, P contains the partition of [2k] with parts {{i, π(i) + k} : i ∈ [k]}. We also prove a similar jump, from exponential to factorial, in the possible speeds of monotone properties of ordered graphs, and of hereditary pro...
متن کاملHereditary quasi-random properties of hypergraphs
Thomason and Chung, Graham and Wilson were the first to investigate systematically properties of quasirandom graphs. They have stated several quite disparate graph properties—such as having uniform edge distribution or containing a prescribed number of certain subgraphs—and proved that these properties are equivalent in a deterministic sense. Simonovits and Sós introduced a hereditary property ...
متن کاملA Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing
Fox, Gromov, Lafforgue, Naor, and Pach proved a regularity lemma for semi-algebraic kuniform hypergraphs of bounded complexity, showing that for each ǫ > 0 the vertex set can be equitably partitioned into a bounded number of parts (in terms of ǫ and the complexity) so that all but an ǫ-fraction of the k-tuples of parts are homogeneous. We prove that the number of parts can be taken to be polyno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 99 شماره
صفحات -
تاریخ انتشار 2009